A New family of Ideal Multipartite Access Structure Based on MSP
نویسندگان
چکیده
Secret sharing schemes are methods designed to share a secret among a group of participants in such a way that the secret can be reconstruct only by specified groups of participant, if non-allowed coalitions cannot obtain any information about the secret. Then the scheme is said to be perfect. Let P = {p1, p2, . . . , pn} be the set of players. The family of qualified subsets Γ ⊆ 2 is called the access structure if it is closed under taking supersets (A ∈ Γ, A ⊂ B ⇒ B ∈ Γ). Thus the set of minimal elements in Γ, denoted Γ, determines the whole structure Γ and it is called the basis of Γ. One of the basic paraments of a secret sharing scheme ∑
منابع مشابه
New Results on Ideal Multipartite Secret Sharing and its Applications to Group Communications
With the rapid development of various group-oriented services, multipartite group communications occur frequently in a single network, where a multipartite access structure is defined to be a collection of the subsets of users who may come from different parts of the network such that only users in an authorized subset of users can use their shares to build up a group key for a secure group com...
متن کاملOn Representable Matroids and Ideal Secret Sharing
In secret sharing, the exact characterization of ideal access structures is a longstanding open problem. Brickell and Davenport (J. of Cryptology, 1991) proved that ideal access structures are induced by matroids. Subsequently, ideal access structures and access structures induced by matroids have attracted a lot of attention. Due to the difficulty of finding general results, the characterizati...
متن کاملOn Multiplicative Secret Sharing Schemes Realizing Graph Access Structures
In this paper we consider graph access structures and we show that such an access structure can be realized by a (strongly) multiplicative monotone span program if and only if the privacy structure contains at least three (resp. four) maximal sets. Thus, we obtain a new family of access structures with an explicit construction that is both ideal and strongly multiplicative. Until now only three...
متن کاملIdeal secret sharing schemes with multipartite access structures
The concept of quasi-threshold multipartite access structures for secret sharing schemes is introduced. These access structures allow one distinguished class of participants to retain control over the reconstruction of the secret, while allowing flexibility over the quorum of participants from other classes. While ideal bipartite access structures have been classified, the case for multipartite...
متن کاملA New Compromise Decision-making Model based on TOPSIS and VIKOR for Solving Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty
This paper proposes a compromise model, based on a new method, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. In this compromise programming method, two concepts are considered simultaneously. First of them is that the optimal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2006 شماره
صفحات -
تاریخ انتشار 2006